package com.wfm.leetcode.editor.cn;

import com.wfm.common.ArrayUtils;

/**
 * dp[0] 手里有股票的最大收益
 * dp[1] 手里没有股票的最大收益
 * 能交易无数次
 */
public class POne22买卖股票的最佳时机II{
//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public int maxProfit(int[] prices) {
        int n = prices.length;
        int[][] dp = new int[n][2];
        dp[0][0] = -prices[0];
        dp[0][1] = 0;
        for (int i = 1; i < n; i++) {
            dp[i][0] = Math.max(dp[i-1][0],-prices[i]+dp[i-1][1]);
            dp[i][1] = Math.max(dp[i-1][1],dp[i-1][0]+prices[i]);
        }
        ArrayUtils.printTwoNum(dp);
        return dp[n-1][1];
    }
}
//leetcode submit region end(Prohibit modification and deletion)

    public static void main(String[] args) { 
        Solution solution = new POne22买卖股票的最佳时机II().new Solution();
        System.out.println(solution.maxProfit(new int[]{1, 4, 1, 4, 1, 4}));
    }
}